Excess information in parametric linear optimization
نویسندگان
چکیده
منابع مشابه
Parametric Query Optimization for Linear and Piecewise Linear Cost Functions
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query optimization (PQO) optimizes a query into a number of candidate plans, each optimal for some region of the parameter space. We first propose a solution for the PQO problem for the case when the cost functions are linear i...
متن کاملBi-parametric optimal partition invariancy sensitivity analysis in linear optimization
In bi-parametric linear optimization (LO), perturbation occurs in both the right-hand-side and the objective function data with different parameters. In this paper, the bi-parametric LO problem is considered and we are interested in identifying the regions where the optimal partitions are invariant. These regions are referred to as invariancy regions. It is proved that invariancy regions are se...
متن کاملStochastic Optimization of Linear Dynamic Systems with Parametric Uncertainties
This paper describes a new approach to solving some stochastic optimization problems for linear dynamic system with various parametric uncertainties. Proposed approach is based on application of tensor formalism for creation the mathematical model of parametric uncertainties. Within proposed approach following problems are considered: prediction, data processing and optimal control. Outcomes of...
متن کاملA parametric simplex algorithm for linear vector optimization problems
In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (Evans-Steuer) algorithm [12]. Different from it, the proposed algorithm works in the parameter space and does not aim to find the set of all efficient solutions. Instead, it finds a solution in the sense of Lö...
متن کاملActive Information Acquisition for Linear Optimization
We consider partially-specified optimization problems where the goal is to actively, but efficiently, acquire missing information about the problem in order to solve it. An algorithm designer wishes to solve a linear program (LP), max cx s.t. Ax ≤ b,x ≥ 0, but does not initially know some of the parameters. The algorithm can iteratively choose an unknown parameter and gather information in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2006
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331930600808350